GALOIS EMBEDDING PROBLEMS WITH CYCLIC QUOTIENT OF ORDER p
نویسندگان
چکیده
Let K be a cyclic Galois extension of degree p over a field F containing a primitive pth root of unity. We consider Galois embedding problems involving Galois groups with common quotient Gal(K/F ) such that corresponding normal subgroups are indecomposable Fp[Gal(K/F )]modules. For these embedding problems we prove conditions on solvability, formulas for explicit construction, and results on automatic realizability.
منابع مشابه
2 00 4 GALOIS EMBEDDING PROBLEMS WITH CYCLIC QUOTIENT OF ORDER p JÁN
Let K/F be a cyclic field extension of odd prime degree. We consider Galois embedding problems involving Galois groups with common quotient Gal(K/F ) such that corresponding normal subgroups are indecomposable Fp[Gal(K/F )]-modules. For these embedding problems we prove conditions on solvability, formulas for explicit construction, and results on automatic realizability.
متن کاملGalois Embedding Problems with Cyclic Quotient
Let K be a cyclic Galois extension of degree p over a field F containing a primitive pth root of unity. We consider Galois embedding problems involving Galois groups with common quotient Gal(K/F ) such that corresponding normal subgroups are indecomposable Fp[Gal(K/F )]modules. For these embedding problems we prove conditions on solvability, formulas for explicit construction, and results on au...
متن کاملM ar 2 00 6 AUTOMATIC REALIZATIONS OF GALOIS GROUPS WITH CYCLIC QUOTIENT OF ORDER p n
We establish automatic realizations of Galois groups among groups M ⋊ G, where G is a cyclic group of order p for a prime p and M is a quotient of the group ring Fp[G]. The fundamental problem in inverse Galois theory is to determine, for a given field F and a given profinite group G, whether there exists a Galois extension K/F such that Gal(K/F ) is isomorphic to G. A natural sort of reduction...
متن کاملAn improved and efficient stenographic scheme based on matrix embedding using BCH syndrome coding.
This paper presents a new stenographic scheme based on matrix embedding using BCH syndrome coding. The proposed method embeds massage into cover by changing some coefficients of cover. In this paper defining a number :::as char:::acteristic of the syndrome, which is invariant with respect to the cyclic shift, we propose a new embedding algorithm base on BCH syndrome coding, without finding ro...
متن کاملGalois Extensions of Lubin-tate Spectra
Let En be the n-th Lubin-Tate spectrum at a prime p. There is a commutative S-algebra E n whose coefficients are built from the coefficients of En and contain all roots of unity whose order is not divisible by p. For odd primes p we show that E n does not have any non-trivial connected finite Galois extensions and is thus separably closed in the sense of Rognes. At the prime 2 we prove that the...
متن کامل